Direct Ramsey theorem for structures involving relations and functions
نویسنده
چکیده
We prove the direct structural Ramsey theorem for structures with relations as well as functions. The result extends the theorem of Abramson and Harrington and of Nešetřil and Rödl.
منابع مشابه
Ramsey properties and extending partial automorphisms for classes of finite structures
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Nešetřil-Rödl Theorem and the second and third authors’ Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with ...
متن کاملAll those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
We prove the Ramsey property of classes of ordered structures with closures and given local properties. This generalises earlier results: the Nešetřil-Rödl Theorem, the Ramsey property of partial orders and metric spaces as well as the author’s Ramsey lift of bowtiefree graphs. We use this framework to give new examples of Ramsey classes. Among others, we show (and characterise) the Ramsey prop...
متن کاملA Ramsey theorem for structures with both relations and functions
We prove a generalization of Prömel’s theorem to finite structures with both relations and functions.
متن کاملRamsey Classes with Closure Operations (Selected Combinatorial Applications)
We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Nešetřil-Rödl Theorem, the author’s Ramsey lift of bowtiefree graphs as well as the Ramsey Theorem for Finite Models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of Structural Ramsey Theorem. We g...
متن کاملSome Bounds for the Ramsey-Paris-Harrington Numbers
It has recently been discovered that a certain variant of Ramsey's theorem cannot be proved in first-order Peano arithmetic although it is in fact a true theorem. In this paper we give some bounds for the "Ramsey-Paris-Harrington numbers" associated with this variant of Ramsey's theorem, involving coloring of pairs . In the course of the investigation we also study certain weaker and stronger p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 119 شماره
صفحات -
تاریخ انتشار 2012